Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
zeros |
→ cons(0,zeros) |
| 2: |
|
tail(cons(X,XS)) |
→ XS |
|
There is one dependency pair:
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006